Optimal wavelength routing on directed fiber trees
نویسندگان
چکیده
منابع مشابه
Optimal Wavelength Routing on Directed Fiber Trees
We present a polynomial time greedy algorithm that assigns proper wavelengths to a set of requests of maximum load L per directed ber link on a directed ber tree using at most 5=3L wavelengths. This improves previous results of 12, 10, 8, 9]. We also prove that no greedy algorithm can in general use less than 5=3L wavelengths for a set of requests of load L in a directed ber tree, and thus our ...
متن کاملWavelength Routing on DirectedFiber Trees ?
We address the issue of eeciently assigning wavelengths to communication requests in wavelength division multiplexing (WDM) optical networks. We consider directed tree and tree of rings topologies. These are topologies of concrete practical relevance for which undirected underlying graph models have been studied by Raghavan and Upfal 6]. Directed models were rst studied by Mihail et al 4]. For ...
متن کاملApproximation Results for Wavelength Routing in Directed Trees
The paper deals with wavelength routing in WDM (wavelength division multiplexing) optical networks. Wavelengths must be assigned to connection requests which are represented as directed paths, and it is required that paths receive different wavelengths if they share a directed link. The goal is to minimize the number of wavelengths used. Mihail et al. [10] conjectured that there is a solution f...
متن کاملNear-Optimal Hot-Potato Routing on Trees
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, which causes conflicting packets to be deflected away from their destinations. We study one-to-many batch routing problems on arbitrary tree topologies. We present two hot-potato routing algorithms, one deterministic and one randomized, whose routing times are asymptotically near-optimal (within pol...
متن کاملOptimal Algorithms for Packet Routing on Trees
In this paper, we study the permutation packet routing problem on trees. We show that every permutation can be routed on a tree of n vertices in n 1 routing steps. We provide an algorithm which produces in O(n) time a schedule that needs O(n) bits for its description. Moreover, we describe an on-line algorithm that completes the routing of any permutation in n 1 routing steps by using at each v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1999
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00029-8